Review on Hiding the Sensitive High Utility Itemsets

نویسندگان

  • Venu Madhav Kuthadi
  • Ying Liu
  • wei-Keng Liao
  • Alok Choudhary
  • Hong Yao
  • Howard J. Hamilton
  • Jianying Hu
  • Aleksandra Mojsilovic
  • Chung-jung Chu
  • Vincent S. Tseng
  • Tyne Liang
  • Jieh-Shan Yeh
  • Po-Chiang Hsu
  • Cheng Wei Wu
  • Bai-En Shie
  • Philip S. Yu
  • Dongwon Lee
  • Sung-Hyuk Park
  • Songchun Moon
  • Chun-Wei Lin
  • Tzung-Pei Hong
  • Hung-Chuan Hsu
  • Guo-cheng Lan
  • Tzung-pei Hong
  • Jen-peng Huang
  • Jia-Wei Wong
  • wen-yang Lin
  • Guo-Cheng Lan
چکیده

The Association Rule Mining is the traditional mining technique which identifies the frequent itemsets from the databases and this technique generates the rules by considering the each items. The traditional association rule mining fails to obtain the infrequent itemsets with higher profit. Since association rule mining technique treats all the items in the database equally by considering only the presence of items within the transaction. The above problem can be solved using the Utility Mining technique. The Utility Mining technique identifies the product combinations with high profit but low frequency itemsets in the transactional database. Hiding High Utility Itemsets (HUIs) is the main challenges faced in the utility mining. In this paper, a detailed discussion about the traditional Association Rule Mining and the various algorithms involved in Utility Mining is explained.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data sanitization in association rule mining based on impact factor

Data sanitization is a process that is used to promote the sharing of transactional databases among organizations and businesses, it alleviates concerns for individuals and organizations regarding the disclosure of sensitive patterns. It transforms the source database into a released database so that counterparts cannot discover the sensitive patterns and so data confidentiality is preserved ag...

متن کامل

A New Algorithm for High Average-utility Itemset Mining

High utility itemset mining (HUIM) is a new emerging field in data mining which has gained growing interest due to its various applications. The goal of this problem is to discover all itemsets whose utility exceeds minimum threshold. The basic HUIM problem does not consider length of itemsets in its utility measurement and utility values tend to become higher for itemsets containing more items...

متن کامل

Reducing Side Effects of Hiding Sensitive Itemsets in Privacy Preserving Data Mining

Data mining is traditionally adopted to retrieve and analyze knowledge from large amounts of data. Private or confidential data may be sanitized or suppressed before it is shared or published in public. Privacy preserving data mining (PPDM) has thus become an important issue in recent years. The most general way of PPDM is to sanitize the database to hide the sensitive information. In this pape...

متن کامل

A GA-Based Approach to Hide Sensitive High Utility Itemsets

A GA-based privacy preserving utility mining method is proposed to find appropriate transactions to be inserted into the database for hiding sensitive high utility itemsets. It maintains the low information loss while providing information to the data demanders and protects the high-risk information in the database. A flexible evaluation function with three factors is designed in the proposed a...

متن کامل

Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining

High-Utility Itemset Mining (HUIM) is an extension of frequent itemset mining, which discovers itemsets yielding a high profit in transaction databases (HUIs). In recent years, a major issue that has arisen is that data publicly published or shared by organizations may lead to privacy threats since sensitive or confidential informationmay be uncovered by data mining techniques. To address this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015